Zarankiewicz problem
biclique-free graph, sparse graphs whose sparsity is controlled by the solution to the Zarankiewicz problem
forbidden subgraph problem, a non-bipartite generalization of the Zarankiewicz problem
forbidden graph characterization, families of graphs defined by forbidden subgraphs of various types
Turán's theorem, a bound on the number of edges of a graph with a forbidden complete subgraph
/suto3/google.iconZarankiewicz problem
/suto3/Google画像検索.iconZarankiewicz problem
/suto3/Google定義検索.icon Zarankiewicz problem
/suto3/wikipedia.iconZarankiewicz problem
/suto3/weblio.icon Zarankiewicz problem
/suto3/kotobank.icon Zarankiewicz problem
/suto3/jisho.icon Zarankiewicz problem